Turing Machines with One-sided Advice and Acceptance of the co-RE Languages
نویسندگان
چکیده
We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on Turing machines with ‘onesided’ advice, which are Turing machines with advice with a restricted scenario for the use of their advice during computations. We show that Turing machines with one-sided advice accept precisely the co-RE languages, even though the advices can be arbitrary. We prove that Turing machines with one-sided advice are not less powerful than their unrestricted version: for all languages L ∈ co-RE, L is accepted by an ordinary Turing machine with advice f if and only L is accepted by a Turing machine with one-sided advice f . We show that co-RE filters into an infinite proper hierarchy, based on the complexity (‘length’) of the advice f(n) a one-sided Turing machine needs for accepting a language. The model and the results dualise to the ordinary RE-languages.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملSpace Hierarchy Results for Randomized Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice. Previous works on hierarchy and separation theorems for such models focused on time as the resource. We obtain tighter results with space as the resource. Our main theorems are the following. Let s(n) be any spaceconstructible function that is Ω(log n) and such that s(an) = O(s(n...
متن کاملAcceptance of -Languages by Communicating Deterministic Turing Machines
Using a specific model of communicating deterministic Turing machines we prove that the class of -languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of -definable ( -definable, respectively) -languages. email: [email protected] email: [email protected] 2 R. Freund and L. Staiger
متن کاملThe University of Chicago Hierarchy Theorems and Resource Tradeoffs for Semantic Classes a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science By
Computational complexity theory studies the minimum resources (time, space, randomness etc.) to solve computational problems. Two fundamental questions in this area are: 1. Can more problems be solved given more of a given resource? A positive answer to this question is known as a hierarchy theorem. 2. Can one resource be traded off with another when solving a given problem? Such a result is kn...
متن کاملAutomata That Take Advice Automata That Take Advice
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 153 شماره
صفحات -
تاریخ انتشار 2017